On the concrete hardness of Learning with Errors
نویسندگان
چکیده
The Learning with Errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and use a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the Learning with Errors problem.
منابع مشابه
Estimating an appropriate plastic concrete mixing design for cutoff walls to control leakage under the earth dam.
Making use of concrete materials in cut-off walls, because of their low permeability and standing high Hydraulic Gradient caused by underground drainage, has attracted great amount of attention. Using ordinary concrete with high elasticity modulus, compared to other materials may accompany with problems including brittleness of cutoffs due to dynamic stresses. To solve this problem, adding a ce...
متن کاملEstimation of the Hardness of the Learning with Errors Problem with a Restricted Number of Samples
The Learning with Errors problem (LWE) is one of the most important hardness assumptions latticebased constructions base their security on. Recently, Albrecht et al. (Journal of Mathematical Cryptology, 2015) presented the software tool LWE-Estimator to estimate the hardness of concrete LWE instances, making the choice of parameters for lattice-based primitives easier and better comparable. To ...
متن کاملA Hybrid Lattice Basis Reduction and Quantum Search Attack on LWE
Recently, an increasing amount of papers proposing postquantum schemes also provide concrete parameter sets aiming for concrete post-quantum security levels. Security evaluations of such schemes need to include all possible attacks, in particular those by quantum adversaries. In the case of lattice-based cryptography, currently existing quantum attacks are mainly classical attacks, carried out ...
متن کاملExperimental Strengthening of the Two-way Reinforced Concrete Slabs with High Performance Fiber Reinforced Cement Composites Prefabricated Sheets
Reinforced concrete structures need to be strengthened and retrofitted for various reasons, including errors during design and/or construction, so in most cases strengthening of structural elements is much more economical than rebuilding the structure. Using HPFRCC with tensile stiffening behavior has been developed to strengthen the concrete structures over the recent few years. In this paper,...
متن کاملNew Tools for Multi-Party Computation
In this work we extend the electronic voting scheme introduced by R. Cramer, R. Gennaro and B. Schoenmakers in [CGS97]. In the original paper the privacy of votes is based on the decisional Di e-Hellman or respectively the higher residuosity assumption. Since both problems can be solved e ciently in the event of quantum computers, a desirable goal is to implement the voting scheme with privacy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015